Sparse Fault-Tolerant BFS Trees

This paper addresses the problem of designing a sparse {\em fault-tolerant} BFS tree, or {\em FT-BFS tree} for short, namely, a sparse subgraph $T$ of the given network $G$ such that subsequent to the failure of a single edge or vertex, the surviving part $T'$ of $T$ still contains a BFS spanning tree for (the surviving part of) $G$. Our main results are as follows. We present an algorithm that for every $n$-vertex graph $G$ and source node $s$ constructs a (single edge failure) FT-BFS tree rooted at $s$ with O(n \cdot \min\{\Depth(s), \sqrt{n}\}) edges, where \Depth(s) is the depth of the BFS tree rooted at $s$. This result is complemented by a matching lower bound, showing that there exist $n$-vertex graphs with a source node $s$ for which any edge (or vertex) FT-BFS tree rooted at $s$ has $\Omega(n^{3/2})$ edges. We then consider {\em fault-tolerant multi-source BFS trees}, or {\em FT-MBFS trees} for short, aiming to provide (following a failure) a BFS tree rooted at each source $s\in S$ for some subset of sources $S\subseteq V$. Again, tight bounds are provided, showing that there exists a poly-time algorithm that for every $n$-vertex graph and source set $S \subseteq V$ of size $\sigma$ constructs a (single failure) FT-MBFS tree $T^*(S)$ from each source $s_i \in S$, with $O(\sqrt{\sigma} \cdot n^{3/2})$ edges, and on the other hand there exist $n$-vertex graphs with source sets $S \subseteq V$ of cardinality $\sigma$, on which any FT-MBFS tree from $S$ has $\Omega(\sqrt{\sigma}\cdot n^{3/2})$ edges. Finally, we propose an $O(\log n)$ approximation algorithm for constructing FT-BFS and FT-MBFS structures. The latter is complemented by a hardness result stating that there exists no $\Omega(\log n)$ approximation algorithm for these problems under standard complexity assumptions

MOCVD-Fabricated TiO2 Thin Films: Influence of Growth Conditions on Fibroblast Cells Culture

TiO2 thin films with various morphologies were grown on Ti substrates by the LP-MOCVD technique (Low Pressure Chemical Vapour Deposition from Metal-Organic precursor), with titanium tetra-iso-propoxide as a precursor. All the films were prepared in the same conditions except the deposition time. They were characterized by X-ray diffraction, scanning electron microscopy, optical 15 interferometry, water contact angle measurements. MOCVD-fabricated TiO2 thin films are known to be adapted to cell culture for implant requirements. Human gingival fibroblasts were cultured on the various TiO2 deposits. Differences in cell viability (MTT tests) and cell spreading (qualitative assessment) were observed and related to film roughness, wettability and allotropic composition

Speeding up shortest path algorithms

Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in shortest paths and $T_\psi(m^*, n)$ is a running time of an algorithm to solve a single-source shortest path problem (SSSP). This is a substantial improvement over a trivial $n$ times application of $\psi$ that runs in $\mathcal{O}(nT_\psi(m,n))$. In our algorithm we use $\psi$ as a black box and hence any improvement on $\psi$ results also in improvement of our algorithm. Furthermore, a combination of our method, Johnson's reweighting technique and topological sorting results in an $\mathcal{O}(m^*n + m \lg n)$ all-pairs shortest path algorithm for arbitrarily-weighted directed acyclic graphs. In addition, we also point out a connection between the complexity of a certain sorting problem defined on shortest paths and SSSP.Comment: 10 page

High frequency diffraction of an electromagnetic plane wave by an imperfectly conducting rectangular cylinder

Copyright @ 2011 IEEEWe shall consider the the problem of determining the scattered far wave field produced when a plane E-polarized wave is incident on an imperfectly conducting rectangular cylinder. By using the the uniform asymptotic solution for the problem of the diffraction of a plane wave by a right-angled impedance wedge, in conjunction with Keller's method, the a high frequency far field solution to the problem is given

The biocompatibility of titanium in a buffer solution: compared effects of a thin film of TiO2 deposited by MOCVD and of collagen deposited from a gel

This study aims at evaluating the biocompatibility of titanium surfaces modified according two different ways: (i) deposition of a bio-inert, thin film of rutile TiO2 by chemical vapour deposition (MOCVD), and (ii) biochemical treatment with collagen gel, in order to obtain a bio-interactive coating. Behind the comparison is the idea that either the bio-inert or the bio-active coating has specific advantages when applied to implant treatment, such as the low price of the collagen treatment for instance. The stability in buffer solution was evaluated by open circuit potential (OCP) for medium time and cyclic voltametry. The OCP stabilized after 5104 min for all the specimens except the collagen treated sample which presented a stable OCP from the first minutes. MOCVD treated samples stabilized to more electropositive values. Numeric results were statistically analysed to obtain the regression equations for long time predictable evolution. The corrosion parameters determined from cyclic curves revealed that the MOCVD treatment is an efficient way to improve corrosion resistance. Human dermal fibroblasts were selected for cell culture tests, taking into account that these cells are present in all bio-interfaces, being the main cellular type of connective tissue. The cells grew on either type of surface without phenotype modification. From the reduction of yellow, water-soluble 3-(4,5-dimethyldiazol-2-yl)-2,5-diphenyl tetrazolium bromide (MTT cytotoxicity test), MOCVD treated samples offer better viability than mechanically polished Ti and collagen treated samples as well. Cell spreading, as evaluated from microscope images processed by the program Sigma Scan, showed also enhancement upon surface modification. Depending on the experimental conditions, MOCVD deposited TiO2 exhibits different nanostructures that may influence biological behaviour. The results demonstrate the capacity of integration in simulated physiologic liquids for an implant pretreated by either method

The future of Cybersecurity in Italy: Strategic focus area

This volume has been created as a continuation of the previous one, with the aim of outlining a set of focus areas and actions that the Italian Nation research community considers essential. The book touches many aspects of cyber security, ranging from the definition of the infrastructure and controls needed to organize cyberdefence to the actions and technologies to be developed to be better protected, from the identification of the main technologies to be defended to the proposal of a set of horizontal actions for training, awareness raising, and risk management

Impacts of the Last Glacial Cycle on ground surface temperature reconstructions over the last millennium

Borehole temperature profiles provide robust estimates of past ground surface temperature changes, in agreement with meteorological data. Nevertheless, past climatic changes such as the Last Glacial Cycle (LGC) generated thermal effects in the subsurface that affect estimates of recent climatic change from geothermal data. We use an ensemble of ice sheet simulations spanning the last 120 ka to assess the impact of the Laurentide Ice Sheet on recent ground surface temperature histories reconstructed from borehole temperature profiles over North America. When the thermal remnants of the LGC are removed, we find larger amounts of subsurface heat storage (2.8 times) and an increased warming of the ground surface over North America by 0.75 K, both relative to uncorrected borehole estimates

The temporal explorer who returns to the base.

In this paper we study the problem of exploring a temporal graph (i.e. a graph that changes over time), in the fundamental case where the underlying static graph is a star on n vertices. The aim of the exploration problem in a temporal star is to find a temporal walk which starts at the center of the star, visits all leaves, and eventually returns back to the center. We present here a systematic study of the computational complexity of this problem, depending on the number k of time-labels that every edge is allowed to have; that is, on the number k of time points where each edge can be present in the graph. To do so, we distinguish between the decision version STAREXP(k) , asking whether a complete exploration of the instance exists, and the maximization version MAXSTAREXP(k) of the problem, asking for an exploration schedule of the greatest possible number of edges in the star. We fully characterize MAXSTAREXP(k) and show a dichotomy in terms of its complexity: on one hand, we show that for both k=2 and k=3 , it can be efficiently solved in O(nlogn) time; on the other hand, we show that it is APX-complete, for every k≥4 (does not admit a PTAS, unless P = NP, but admits a polynomial-time 1.582-approximation algorithm). We also partially characterize STAREXP(k) in terms of complexity: we show that it can be efficiently solved in O(nlogn) time for k∈{2,3} (as a corollary of the solution to MAXSTAREXP(k) , for k∈{2,3} ), but is NP-complete, for every k≥6